Adaptive System Identification using Markov Chain Monte Carlo
نویسندگان
چکیده
منابع مشابه
Adaptive System Identification using Markov Chain Monte Carlo
One of the major problems in adaptive filtering is the problem of system identification. It has been studied extensively due to its immense practical importance in a variety of fields. The underlying goal is to identify the impulse response of an unknown system. This is accomplished by placing a known system in parallel and feeding both systems with the same input. Due to initial disparity in t...
متن کاملSystem identification using evolutionary Markov chain Monte Carlo
System identi®cation involves determination of the functional structure of a target system that underlies the observed data. In this paper, we present a probabilistic evolutionary method that optimizes system architectures for the iden-ti®cation of unknown target systems. The method is distinguished from existing evolutionary algorithms (EAs) in that the individuals are generated from a probabi...
متن کاملAdaptive Markov Chain Monte Carlo through Regeneration
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملAdaptive Markov Chain Monte Carlo Confidence Intervals
In Adaptive Markov Chain Monte Carlo (AMCMC) simulation, classical estimators of asymptotic variances are inconsistent in general. In this work we establish that despite this inconsistency, confidence interval procedures based on these estimators remain consistent. We study two classes of confidence intervals, one based on the standard Gaussian limit theory, and the class of so-called fixed-b c...
متن کاملOn Adaptive Markov Chain Monte Carlo Algorithms
Abstract We look at adaptive MCMC algorithms that generate stochastic processes based on sequences of transition kernels, where each transition kernel is allowed to depend on the past of the process. We show under certain conditions that the generated stochastic process is ergodic, with appropriate stationary distribution. We then consider the Random Walk Metropolis (RWM) algorithm with normal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TELKOMNIKA Indonesian Journal of Electrical Engineering
سال: 2015
ISSN: 2087-278X,2302-4046
DOI: 10.11591/telkomnika.v13i1.6925